The chromatic index of strongly regular graphs
نویسندگان
چکیده
منابع مشابه
5-chromatic Strongly Regular Graphs
In this paper, we begin the determination of all primitive strongly regular graphs with chromatic number equal to 5. Using eigenvalue techniques, we show that there are at most 43 possible parameter sets for such a graph. For each parameter set, we must decide which strongly regular graphs, if any, possessing the set are 5-chromatic. In this way, we deal completely with 34 of these parameter se...
متن کاملd-Regular Graphs of Acyclic Chromatic Index
An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a′(G). It was conjectured by Alon, Sudakov and Zaks (and earlier by Fiamcik) that a′(G)≤ +2, where = (G) denotes the maximum degree of the graph. Alon e...
متن کاملBall packings with high chromatic numbers from strongly regular graphs
Inspired by Bondarenko’s counter-example to Borsuk’s conjecture, we notice some strongly regular graphs that provide examples of ball packings whose chromatic numbers are significantly higher than the dimensions. In particular, from generalized quadrangles we obtain unit ball packings in dimension q3 − q2 + q with chromatic number q3 + 1, where q is a prime power. This improves the previous low...
متن کاملStrongly regular graphs
Strongly regular graphs form an important class of graphs which lie somewhere between the highly structured and the apparently random. This chapter gives an introduction to these graphs with pointers to more detailed surveys of particular topics.
متن کاملDisconnecting strongly regular graphs
In this paper, we show that the minimum number of vertices whose removal disconnects a connected strongly regular graph into non-singleton components, equals the size of the neighborhood of an edge for many graphs. These include blocks graphs of Steiner 2-designs, many Latin square graphs and strongly regular graphs whose intersection parameters are at most a quarter of their valency.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ars Mathematica Contemporanea
سال: 2021
ISSN: 1855-3974,1855-3966
DOI: 10.26493/1855-3974.2435.ec9